OPTIMAL LOCATION PROBLEM FOR URBAN EMERGENCY VEHICLES WITH CONTINUOUS-TIME MARKOV CHAIN
نویسندگان
چکیده
منابع مشابه
Optimal Consumption and Insurance: A Continuous-Time Markov Chain Approach
Personal financial decision making plays an important role in modern finance. Decision problems about consumption and insurance are modelled in a continuous-time multi-state Markovian framework. The optimal solution is derived and studied. The model, the problem, and its solution are exemplified by two special cases: In one model the individual takes optimal positions against the risk of dying;...
متن کاملModular Capacitated Maximal Covering Location Problem for the Optimal Siting of Emergency Vehicles
To improve the application of the maximal covering location problem (MCLP), several capacitated MCLP models were proposed to consider the capacity limits of facilities. However, most of these models assume only one fixed capacity level for the facility at each potential site. This assumption may limit the application of the capacitated MCLP. In this article, a modular capacitated maximal coveri...
متن کاملOptimal Continuous Time Markov Decisions
In the context of Markov decision processes running in continuous time, one of the most intriguing challenges is the efficient approximation of finite horizon reachability objectives. A multitude of sophisticated model checking algorithms have been proposed for this. However, no proper benchmarking has been performed thus far. This paper presents a novel and yet simple solution: an algorithm, o...
متن کاملLocation-Routing Problem with Fuzzy Time Windows and Traffic Time
The location-routing problem is a relatively new branch of logistics system. Its objective is to determine a suitable location for constructing distribution warehouses and proper transportation routing from warehouse to the customer. In this study, the location-routing problem is investigated with considering fuzzy servicing time window for each customer. Another important issue in this regard ...
متن کاملA cross entropy algorithm for continuous covering location problem
Covering problem tries to locate the least number of facilities and each demand has at least one facility located within a specific distance.This paper considers a cross entropy algorithm for solving the mixed integer nonlinear programming (MINLP) for covering location model.The model is solved to determine the best covering value.Also, this paper proposes aCross Entropy (CE) algorithm consider...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Operations Research Society of Japan
سال: 2004
ISSN: 1349-8940,2188-8280
DOI: 10.15807/torsj.47.25